#define DEBUG
#include <cstdio>

using namespace std;

const int maxn=100000, maxm=300000;

class Graph {
	public:
		int n, m, ind[maxn+1], to[2*maxm+1], link[2*maxm+1];
		double val[2*maxm+1][3];

		void addSide(int u, int v, int x) {
			m++;
			to[m] = v;
			link[m] = ind[u];
		}
};

int main() {
	freopen("tiring.in", "r", stdin);
	freopen("tiring.out", "w", stdout);

	int n, m;
	scanf("%d %d", &n, &m);
	for (int i=1; i<=n; i++) {
		int u, v, x;
		scanf("%d %d %d", &u, &v, &x);
	}

	fclose(stdin);
	fclose(stdout);
	return 0;
}
